Preserving sparity for general solution of linear Diophantine systems

Preserving Sparity for General Solution of Linear Diophantine Systems

Here, we present an efficient algorithm for preserveving sparsity in computing the general solution of linear Diophantin systems. In the kth iteration of the algorithm, the general solution k − 1 equations of the systems is at hand. Then, we present numerical results to justify the efficiency of the resulting algorithm. Mathematics Subject Classification: 11D04, 65Y04

On Solving Linear Diophantine Systems Using Generalized Rosser's Algorithm

Minimal solution of fuzzy linear systems

In this paper, we use parametric form of fuzzy number and we converta fuzzy linear system to two linear system in crisp case. Conditions for the existence of a minimal solution to $mtimes n$ fuzzy linear equation systems are derived and a numerical procedure for calculating the minimal solution is designed. Numerical examples are presented to illustrate the proposed method.

Sequential second derivative general linear methods for stiff systems

‎Second derivative general linear methods (SGLMs) as an extension‎ ‎of general linear methods (GLMs) have been introduced to improve‎ ‎the stability and accuracy properties of GLMs‎. ‎The coefficients of‎ ‎SGLMs are given by six matrices‎, ‎instead of four matrices for‎ ‎GLMs‎, ‎which are obtained by solving nonlinear systems of order and‎ ‎usually Runge--Kutta stability conditions‎. ‎In this p...

General Solution for Fuzzy Linear Second Order Differential Equation Using First Solution

The fuzzy linear second order equations with fuzzy initial values are investigatedin this paper. The analytic general solution solutions of them usinga rst solution is founded. The parametric form of fuzzy numbers is appliedto solve the second order equations. General solutions for fuzzy linear secondorder equations with fuzzy initial values are investigated and formulatedin four cases. A examp...